Challenges and Solutions for Hierarchical Task Network Planning in E-Learning

نویسندگان

  • Carsten Ullrich
  • Okhtay Ilghami
چکیده

This paper describes a collaboration between two PhD students. The first author is developing a course generator (CG) for a Web-based e-learning environments (WBLE) [3]. A CG generates sequences of learning objects according to the learner’s goals and individual properties. The assembling process is knowledge intensive: assembling courses that implement modern pedagogical theories requires a framework that allows to represent complex pedagogical strategies. The strategies are implemented using the Hierarchical Task Network (HTN) planner JSHOP2 [1], developed by the second author. In HTN planning, the goal of the planner is to achieve an ordered list of top tasks, where each task is a symbolic representation of an activity to be performed. The planner formulates a plan by applying methods that decompose these top tasks into smaller and smaller subtasks until primitive tasks are reached that can be carried out directly. When we applied the HTN framework to WBLE, we encountered several challenges, which we will describe in this paper, together with our solutions. We believe that this work is of general interest, as today’s WBLE are excellent examples of distributed information systems and illustrate the challenges that can arise in complex scenarios.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Course Generation Based on HTN Planning

A course generator automatically assembles learning objects retrieved from one or several repositories to a greater unit. Different frameworks for course generation exists, but only a few allow the representation of sophisticated pedagogical knowledge. In this paper, we describe course generation based on pedagogical tasks and methods, formalized in a hierarchical task network (HTN) planner. We...

متن کامل

Planning road network in mountain forests using GIS and Analytic Hierarchical Process (AHP)

Forest road construction is the most costly operation in forestry. Road designing and construction in unsuitable areas may increase construction and maintenance costs and also cause many environmental impacts. Therefore, it is required to pay more attention to forest road design. In this research, we tried to introduce an appropriate method for locating forest roads using GIS and AHP simultaneo...

متن کامل

From Task Definitions and Plan Traces to HTN Methods

Hierarchical Task Network (HTN) planning is an important, frequently studied research topic in artificial intelligence. Researchers have reported work on its formalisms and applications (Erol, Hendler, & Nau 1994; Smith, Nau, & Erol 1998; Nau et al. 2005). In HTN planning, complex tasks are decomposed into simpler tasks until a sequence of primitive actions is generated. HTN planning is frequen...

متن کامل

Task Complexity Manipulation and EFL learners’ interactions in the process of collaborative pre-planning

Today, learners’ interaction and collaborative task performance have attracted increasing attention from language teachers and researchers. The present study investigated whether collaborative pre-planning, task complexity manipulation, and language proficiency level play a role in learners’ interactions. To this end, 128 EFL learners from two different language proficiency levels carried out t...

متن کامل

HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required

We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as input the initial states from a set of classical planning problems in a planning domain and solutions to those problems, as well as a set of semantically-annotated tasks to be accomplished. The algorithm analyzes this sema...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006